Study on computation method of generalized cylic matrix determinant 一类类循环矩阵行列式计算方法的研究
In this article , the auther evaluated the mimimal path sets between two nodes with the conection matrix determinant , not the tranditional matrix square function , which greatly reduced the algorithm complexity 本文用联络矩阵的行列式运算代替传统的矩阵乘方运算来求网络两点之间正常的状态集合,进而求出网络系统的可靠度,极大的减少了运算的复杂性。